Succinct Encodings of Graph Isomorphism
نویسندگان
چکیده
It is well known that problems encoded with circuits or formulas generally gain an exponential complexity blow-up compared to their original
منابع مشابه
"Everything Is Everything" Revisited: Shapeshifting Data Types with Isomorphisms and Hylomorphisms
This paper is an exploration of isomorphisms between elementary data types (e.g., natural numbers, sets, finite functions, graphs, hypergraphs) and their extension to hereditarily finite universes through hylomorphisms derived from ranking/unranking and pairing/unpairing operations. An embedded higher order combinator language provides any-toany encodings automatically. A few examples of free a...
متن کاملA Survey of the Complexity of Succinctly Encoded Problems
Succinctness is one of the few ways that we have to get a handle on the complexity of large classes such as NEXP and EXPSPACE. The study of succinctly encoded problems was started by Galperin and Wigderson [3], who showed that many simple graph properties such as connectedness are NP-complete when the graph is represented by a succinct circuit. Papadimitriou and Yannakakis [4], building upon th...
متن کاملMinimum Circuit Size, Graph Isomorphism, and Related Problems
We study the computational power of deciding whether a given truth-table can be described by a circuit of a given size (the Minimum Circuit Size Problem, or MCSP for short), and of the variant denoted as MKTP where circuit size is replaced by a polynomially-related Kolmogorov measure. All prior reductions from supposedly-intractable problems to MCSP / MKTP hinged on the power of MCSP / MKTP to ...
متن کاملSuccinct Indexes
This thesis defines and designs succinct indexes for several abstract data types (ADTs). The concept is to design auxiliary data structures that ideally occupy asymptotically less space than the information-theoretic lower bound on the space required to encode the given data, and support an extended set of operations using the basic operators defined in the ADT. As opposed to succinct (integrat...
متن کاملGraph Isomorphism
While in general it is not known whether there is a polynomial time algorithm to decide whether two given graphs are isomorphic, there are polynomial-time algorithms for certain subsets of graphs, including but not limited to planar graphs and graphs with bounded valence. In this thesis, we will give a brief introduction on the Graph Isomorphism Problem and its relations to complexity theory. W...
متن کامل